Direct Sum Questions in Classical Communication Complexity
نویسنده
چکیده
In 1988, Karchmer and Wigderson generalized Yao’s two-party communication model of functions to relations and showed a remarkable connection of this model to the Boolean circuit model. A few years later, continuing this line of work, Karchmer, Raz, and Wigderson proposed a program to separate NC from P through direct-sum-type inequalities in communication complexity. This spurred the study of this fundamental question in communication complexity: given problems A and B, is it easier to solve A and B together than separately? It seems that we are still far from separating NC from P ; however, during the last 20 years of research our knowledge of the behavior of different communication complexity measures with respect to the direct sum has seen a lot of progress. We survey some of these results in this paper and make a new observation about the recent approach to the direct-sum question in the randomized setting.
منابع مشابه
Improved direct sum theorem in classical communication complexity
For a function f : X ×Y → Z , the m-fold direct sum is the function f : X × Y → Z, defined by f(〈x1, . . . , xm〉, 〈y1, . . . , ym〉) ∆ = 〈f(x1, y1), . . . , f(xm, ym)〉. We show the following direct sum theorem for classical communication protocols, R(f) = Ω( m k R(f)) where R(f) is the the k-round private coins communication complexity of f and R(f) is the k-round public coin complexity of f . I...
متن کاملTwo-Party Direct-Sum Questions Through the Lens of Multiparty Communication Complexity
1 Abbreviations and Notations 4
متن کاملOptimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity
We show optimal Direct Sum result for the one-way entanglement-assisted quantum communication complexity for any relation f ⊆ X × Y × Z. We show: Q(f) = Ω(m · Q(f)), where Q(f), represents the one-way entanglement-assisted quantum communication complexity of f with error at most 1/3 and f⊕m represents m-copies of f . Similarly for the one-way public-coin classical communication complexity we sh...
متن کاملA New, Fully Quantum Notion of Information Complexity, and an Application to Direct Sum for Bounded Round Quantum Communication Complexity
Direct Sum for Bounded Round Quantum Communication Complexity Dave Touchette 1 We present the first general direct sum theorem for quantum communication complexity that holds for more than a single round of communication. A direct sum theorem states that to compute n tasks simultaneously requires as much resources as the amount of the given resource required for computing them separately. By a ...
متن کاملDirect Sum Theorem for Bounded Round Quantum Communication Complexity
We prove a direct sum theorem for bounded round entanglement-assisted quantum communication complexity. To do so, we use the fully quantum definition for information cost and complexity that we recently introduced, and use both the fact that information is a lower bound on communication, and the fact that a direct sum property holds for quantum information complexity. We then give a protocol fo...
متن کامل